Model Extraction for Sockets-based Distributed Programs
نویسنده
چکیده
The following short report introduces an approach to utilize unbounded, reliable fifo queues as basis for an operational semantics of distributed applications whose implementation is based on the Berkeley Sockets Api. After a sketch of Tcp and the Sockets Api, a first draft of a formalization of distributed programs is given as well as a straight-forward translation into the abstract formal model of queueing concurrent processes.
منابع مشابه
Microscopic examination of the effect of bromelain on the healing of tooth extraction sockets in an animal model
Background and Aims: Bromelain is a substance derived from pineapple and has antioxidant, anti-inflammatory, and analgesic effects. This study aimed to investigate the effect of bromelain on the healing of tooth extraction sockets in an animal model. Materials and Methods: This experimental study was performed on 24 male rats. After anesthesia, the first maxillary molar tooth was extracted wit...
متن کاملTiming UDP: Mechanized Semantics for Sockets, Threads, and Failures
This paper studies the semantics of failure in distributed programming. We present a semantic model for distributed programs that use the standard sockets interface; it covers message loss, host failure and temporary disconnection, and supports reasoning about distributed infrastructure. We consider interaction via the UDP and ICMP protocols. To do this, it has been necessary to: • construct an...
متن کاملStenning's Protocol Implemented in UDP and Verified in Isabelle
This paper is about the mechanical verification of UDP based network programs. It uses the UDP portion of a formal model of the Internet protocols TCP (Transmission Control Protocol) and UDP (User Datagram Protocol). The model includes asynchronous message passing, message loss and host failure. The model is based around the sockets library, the primary API used for writing UDP and TCP based ap...
متن کاملDist-Orc: A Rewriting-based Distributed Implementation of Orc with Formal Analysis
Orc is a theory of orchestration of services that allows structured programming of distributed and timed computations. Several formal semantics have been proposed for Orc, including a rewriting logic semantics developed by the authors. Orc also has a fully fledged implementation in Java with functional programming features. However, as with descriptions of most distributed languages, there exis...
متن کاملAn Overview of Slicing Techniques for Object-Oriented Programs
This paper surveys the existing slicing techniques for object-oriented programs. Many commercial objectoriented programs are concurrent in nature. Concurrency is typically implemented in the form of multithreading or message passing using sockets or both. We therefore review the available techniques in slicing of concurrent object-oriented programs. Another trend that is clearly visible in obje...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009